Time Variant-Peer Node Heterogeneous Peer to Peer Networks using Dynamic Warping Algorithm
نویسندگان
چکیده
منابع مشابه
Time Variant-Peer Node Heterogeneous Peer to Peer Networks using Dynamic Warping Algorithm
In the current internet scenario more virtual servers and mirror servers are utilized to maintain load balance of the heterogeneous peer to peer networks. One of the most current existing works developed a state balancing system based on probability distribution of peer abilities, loads of virtual servers, and incomplete data of global peers. On the other hand state balancing method recognizing...
متن کاملNode Coordination in Peer-to-Peer Networks
Peer-to-peer networks and other many-to-many relations have become popular especially for content transfer. To better understand and trust these types of networks, we need formally derived and verified models for them. Due to the large scale and heterogeneity of these networks, it may be difficult and cumbersome to create and analyse complete models. In this paper, we employ the modularisation ...
متن کاملDynamic Search Algorithm used in Unstructured Peer-to-Peer Networks
Designing efficient search algorithms is a key challenge in unstructured peer-to-peer networks. Flooding and random walk (RW) are two typical search algorithms. Flooding searches aggressively and covers the most nodes. However, it generates a large amount of query messages and, thus, does not scale. On the contrary, RW searches conservatively. It only generates a fixed amount of query messages ...
متن کاملDynamic Search Algorithm in Unstructured Peer-to-Peer Networks
Designing efficient search algorithms is a key challenge in unstructured peer-to-peer networks. Flooding and random walk (RW) are two typical search algorithms. Flooding searches aggressively and covers the most nodes. However, it generates a large amount of query messages and, thus, does not scale. On the contrary, RW searches conservatively. It only generates a fixed amount of query messages ...
متن کاملConnectivity Based Node Clustering in Decentralized Peer-to-Peer Networks
Connectivity based node clustering has wide ranging applications in decentralized Peer-to-Peer (P2P) networks such as P2P file sharing systems, mobile ad-hoc networks, P2P sensor networks and so forth. This paper describes a Connectivity-based Distributed Node Clustering scheme (CDC). This scheme presents a scalable and an efficient solution for discovering connectivity based clusters in peer n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/6273-8436